A New Artificial Immune System Algorithm for Multiobjective Fuzzy Flow Shop
نویسندگان
چکیده
منابع مشابه
A New Artificial Immune System Algorithm for Multiobjective Fuzzy Flow Shop
In this paper a new artificial immune system (AIS) algorithm is proposed to solve multi objective fuzzy flow shop scheduling problems. A new mutation operator is also described for this AIS. Fuzzy sets are used to model processing times and due dates. The objectives are to minimize the average tardiness and the number of tardy jobs. The developed new AIS algorithm is tested on real world data c...
متن کاملMultiobjective Artificial Immune Algorithm for Flexible Job Shop Scheduling Problem
Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...
متن کاملConvergence Analysis of a Multiobjective Artificial Immune System Algorithm
This paper presents a mathematical proof of convergence of a multiobjective artificial immune system algorithm (based on clonal selection theory). An specific algorithm (previously reported in the specialized literature) is adopted as a basis for the mathematical model presented herein. The proof is based on the use of Markov chains.
متن کاملArtificial Immune System algorithm for multi objective flow shop scheduling problem
The n-job, m-machine flow shop scheduling problem is one of the most general job scheduling problems. This study deals with the multi objective optimization with the criteria of makespan minimization and minimization of total weighted flow time for the flow shop scheduling problem. The n-job mmachine problem is known to be NP hard problem, several meta heuristics have been applied so far in the...
متن کاملHybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility
This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2009
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2009.9727656